A sparse algorithm for dense optimal transport
نویسنده
چکیده
Discrete optimal transport solvers do not scale well on dense large problems since they do not explicitly exploit the geometric structure of the cost function. In analogy to continuous optimal transport we provide a framework to verify global optimality of a discrete transport plan locally. This allows construction of a new sparse algorithm to solve large dense problems by considering a sequence of sparse problems instead. Any existing discrete solver can be used as internal black-box. The case of noisy squared Euclidean distance is explicitly detailed. We observe a significant reduction of run-time and memory requirements.
منابع مشابه
Dealing with Dense Rows in the Solution of Sparse Linear Least Squares Problems1
Sparse linear least squares problems containing a few relatively dense rows occur frequently in practice. Straightforward solution of these problems could cause catastrophic ll and delivers extremely poor performance. This paper studies a scheme for solving such problems eeciently by handling dense rows and sparse rows separately. How a sparse matrix is partitioned into dense rows and sparse ro...
متن کاملSmooth and Sparse Optimal Transport
Entropic regularization is quickly emerging as a new standard in optimal transport (OT). It enables to cast the OT computation as a differentiable and unconstrained convex optimization problem, which can be efficiently solved using the Sinkhorn algorithm. However, the entropy term keeps the transportation plan strictly positive and therefore completely dense, unlike unregularized OT. This lack ...
متن کاملDealing with Dense Rows in the Solution of Sparse Linear Least Squares Problems
Sparse linear least squares problems containing a few relatively dense rows occur frequently in practice. Straightforward solution of these problems could cause catastrophic ll and delivers extremely poor performance. This paper studies a scheme for solving such problems eeciently by handling dense rows and sparse rows separately. How a sparse matrix is partitioned into dense rows and sparse ro...
متن کاملSIMULATED ANNEALING ALGORITHM FOR SELECTING SUBOPTIMAL CYCLE BASIS OF A GRAPH
The cycle basis of a graph arises in a wide range of engineering problems and has a variety of applications. Minimal and optimal cycle bases reduce the time and memory required for most of such applications. One of the important applications of cycle basis in civil engineering is its use in the force method to frame analysis to generate sparse flexibility matrices, which is needed for optimal a...
متن کاملA Soft-Input Soft-Output Target Detection Algorithm for Passive Radar
Abstract: This paper proposes a novel scheme for multi-static passive radar processing, based on soft-input soft-output processing and Bayesian sparse estimation. In this scheme, each receiver estimates the probability of target presence based on its received signal and the prior information received from a central processor. The resulting posterior target probabilities are transmitted to the c...
متن کامل